منابع مشابه
Efficient Parallel Algorithms for Tree Accumulations
Accumulations are higher-order operations on structured objects; they leave the shape of an object unchanged, but replace elements of that object with accumulated information about other elements. Upwards and downwards accumulations on trees are two such operations; they form the basis of many tree algorithms. We present two Erew Pram algorithms for computing accumulations on trees taking O(log...
متن کاملEfficient Parallel Algorithms for Tree-Decomposition and Related Problems
We present an efficient parallel algorithm for the treedecomposition problem for fixed width w. The algorithm runs in time O(10g3 n) and uses O(n) processors on a CRCW PRAM. This enables us to construct efficient parallel algorithms for three important classes of problems: MS properties, linear EMS extremum problems and enumeration problems for MS properties, when restricted to graphs of tree-w...
متن کاملEfficient algorithms for decision tree cross-validation
Cross-validation is a useful and generally applicable technique often employed in machine learning, including decision tree induction. An important disadvantage of straightforward implementation of the technique is its computational overhead. In this paper we show that, for decision trees, the computational overhead of cross-validation can be reduced significantly by integrating the crossvalida...
متن کاملEfficient Algorithms for the Tree Homeomorphism Problem
Tree pattern matching is a fundamental problem that has a wide range of applications in Web data management, XML processing, and selective data dissemination. In this paper we develop efficient algorithms for the tree homeomorphism problem, i.e., the problem of matching a tree pattern with exclusively transitive (descendant) edges. We first prove that deciding whether there is a tree homeomorph...
متن کاملAlgorithms for efficient phylogenetic tree construction
The gene-duplication problem is to infer a species supertree from a collection of gene trees that are confounded by complex histories of gene duplications. This problem is NP-hard and thus requires efficient and effective heuristics. Existing heuristics perform a stepwise search of the tree space, where each step is guided by an exact solution to an instance of a local search problem. These loc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 1994
ISSN: 0167-6423
DOI: 10.1016/0167-6423(94)00013-1